New Construction of Low-Density Parity-Check Codes Based on Vector Space Over Finite Fields
نویسندگان
چکیده
منابع مشابه
A New Construction for Low Density Parity Check Convolutional Codes
Low density parity check (LDPC) block codes have been shown to achieve near capacity performance for binary transmission over noisy channels. Block codes, however, require splitting the data to be transmitted into frames, which can be a disadvantage in some applications. Convolutional codes, on the other hand, have no such requirement, and are hence well suited for continuous transmission. In [...
متن کاملLow Density Parity Check Codes
Low Density Parity Check Codes originally invented by Gallagher and subsequently rediscovered by multiple groups 30 years later has become the best known error correcting code in a variety of situations. In this paper, we review regular and irregular LDPC codes. We describe a number of message passing decoders for decoding these codes and explain their operation via examples. Density evolution,...
متن کاملLow-density parity-check codes
A low-density parity-check code is a code specified by a parity-check matrix with the following properties : each column contains a small fixed numberj > 3 of I’s and each row contains a small fixed number k > j of 1’s. The typical minimum distance of these codes increases linearly with block length for a fixed rate and fixed j. When used with maximum likelihood decoding on a snfhciently quiet ...
متن کاملOn Constructing Low-Density Parity-Check Codes
This thesis focuses on designing Low-Density Parity-Check (LDPC) codes for forward-error-correction. The target application is real-time multimedia communications over packet networks. We investigate two code design issues, which are important in the target application scenarios, designing LDPC codes with low decoding latency, and constructing capacity-approaching LDPC codes with very low error...
متن کاملLow-density parity-check codes based on finite geometries: A rediscovery and new results
This paper presents a geometric approach to the construction of low-density parity-check (LDPC) codes. Four classes of LDPC codes are constructed based on the lines and points of Euclidean and projective geometries over finite fields. Codes of these four classes have good minimum distances and their Tanner graphs have girth 6. Finite-geometry LDPC codes can be decoded in various ways, ranging f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3037290